Arithmetic Coding for Noisy Channels
نویسنده
چکیده
Arithmetic Coding is generalized to provide a method for transforming source output se quences into sequences whose probability distribution approaches any desired probability distribution. A further modi cation in which gaps are introduced be tween source intervals allows arithmetic encoders to produce code sequences with any information rate, enabling the encoder to perform joint source-chan nel coding. The results of a simulation are presented where arithmetic coding is used as a channel encoder in conjunction with a sequential decoder.
منابع مشابه
A Theoretical Analysis of Robust Coding over Noisy Overcomplete Channels
Biological sensory systems are faced with the problem of encoding a high-fidelity sensory signal with a population of noisy, low-fidelity neurons. This problem can be expressed in information theoretic terms as coding and transmitting a multi-dimensional, analog signal over a set of noisy channels. Previously, we have shown that robust, overcomplete codes can be learned by minimizing the recons...
متن کاملSoft decoding and synchronization of arithmetic codes: application to image transmission over noisy channels
This paper addresses the issue of robust and joint source-channel decoding of arithmetic codes. We first analyze dependencies between the variables involved in arithmetic coding by means of the Bayesian formalism. This provides a suitable framework for designing a soft decoding algorithm that provides high error-resilience. It also provides a natural setting for "soft synchronization", i.e., to...
متن کاملSecret Sharing Through Noisy Quantum Channels
In a realistic situation, the secret sharing of classical or quantum information will involve the transmission of this information through noisy channels. We consider a three qubit pure state. This state becomes a mixed-state when the qubits are distributed over noisy channels. In the case of a specific noisy channel, the phase-damping channel, we show that the secret sharing of classical infor...
متن کاملA General Fixed Rate Arithmetic Coding Method for Constrained Channels
This paper extends the result of earlier work on the application of arithmetic codes to the constrained channel problem. We specifically present a general length-based $xed rate implementation technique which performs the arithmetic coding recursions during each channel time unit. This technique is superior to an earlier unpublished code for general constrained channels. The approach permits th...
متن کاملCoding for Relay Networks and Effective Secrecy for Wire-tap Channels
This thesis addresses two problems of network information theory: coding for relay networks and (accurate) approximations of distributions based on unnormalized informational divergence with applications to network security. For the former problem, we first consider short message noisy network coding (SNNC). SNNC differs from long message noisy network coding (LNNC) in that one transmits many s...
متن کامل